3-D Point Cloud Registration Algorithm Based on Greedy Projection Triangulation
نویسندگان
چکیده
منابع مشابه
Indoor Scene Point Cloud Registration Algorithm Based on RGB-D Camera Calibration
With the increasing popularity of RGB-depth (RGB-D) sensor, research on the use of RGB-D sensors to reconstruct three-dimensional (3D) indoor scenes has gained more and more attention. In this paper, an automatic point cloud registration algorithm is proposed to efficiently handle the task of 3D indoor scene reconstruction using pan-tilt platforms on a fixed position. The proposed algorithm aim...
متن کاملResearch on the Multi-view Point 3-D Clouds Splicing Algorithm based on Local Registration
The paper proposed a new 3-D measurement point cloud splicing algorithm. The algorithm utilizes registration ideal in model identification technology to realize unbound and accurate splicing of 3-D data. First, sample the overlapping areas in the two 3-D point clouds which need to be spliced. Carry out preprocessing over the sampled point cloud with principal analysis method based on the statis...
متن کاملA Quick Image Registration Algorithm Based on Delaunay Triangulation
The traditional image matching algorithms adopt more complex strategies when dealing with mismatch caused by a lot of noise. In this paper, a simple, intuitive and effective noise processing algorithm is proposed based on Delaunay triangulation in computational geometry. The algorithm extracts feature points using SIFT method, respectively establishes Delaunay triangulation in multi-spectral an...
متن کاملA Surface Reconstruction Algorithm Based on 3 D Point Cloud Stratified
This paper presents a novel surface reconstruction algorithm based on 3D point cloud sliced by a series of planes vertical to Z-axis. First, the density and distribution of point cloud is analyzed in vertical direction Z-axis and a stratified point cloud model is put forward to present an object feature, in which point cloud is sliced with irregular intervals. An approach of stratified point cl...
متن کاملOptimization of Unscented Kalman Filter Algorithm for 3-D Point Based Rigid Registration
This paper proposes an optimized algorithm for 3-D Point Based Rigid Registration. This algorithm uses an Unscented Kalman filter (UKF) for estimating the state vector of transformation, which can be interpreted as a nonlinear function of translation and rotation. In the previous work, we showed that the drawback of the UKF algorithm in estimating high range rotations is due to its sensitivity ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Sciences
سال: 2018
ISSN: 2076-3417
DOI: 10.3390/app8101776